Effective Packing Dimension and Traceability Rod Downey and Keng

نویسندگان

  • MENG NG
  • KENG MENG NG
چکیده

The concern of this paper is with effective packing dimension. This concept can be traced back to the work of Borel and Lebesgue who studied measure as a way of specifying the size of sets. Carathéodory later generalized Lebesgue measure to the n-dimensional Euclidean space, and this was taken further by Hausdorff [Hau19] who generalized the notion of s-dimensional measure to include non-integer values for s in any metric space. In the Cantor space with the clopen topology, this can be viewed as a scaling of the usual Lebesgue measure by a factor of s, in the sense of μs([σ]) = 2−s|σ|, where [σ] is the clopen set generated by σ, and 0 ≤ s ≤ 1. This gave rise to the concept of classical Hausdorff dimension, which provided a way of classifying different sets of measure zero, based on the intuition that not all null sets are created equal. There appeared many other related classical notions of fractional dimensions, such as box-counting dimension and packing dimension. The study of effective notions of randomness and their relationship with the Turing degrees was initiated by the early work of de Leeuw, Moore, Shannon and Shapiro [dLMSS56]. The effective versions of these various notions of fractional dimensions have been studied in connection with randomness. The best known examples of such effective notions are the effective Hausdorff, and effective packing dimensions. Hausdorff measure talks about covering the set by open balls from the exterior, while packing measure considers filling up a set from the interior. One can effectivize these two notions by looking at covering with Σ1 open sets in the Cantor space with s-measure. This work took a new direction when various authors Lutz [Lut90, Lut03], Staiger [Sta93], Mayordomo [May02], Artheya et al [AHLM04], and Reimann [Rei04] showed that there were simple characterizations of effective Hausdorff and packing dimensions using Kolmogorov complexity. Indeed, the effective Hausdorff dimension of a real A can be written as

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Lowness for Bounded Randomness Rod Downey and Keng

In [3], Brodhead, Downey and Ng introduced some new variations of the notions of being Martin-Löf random where the tests are all clopen sets. We explore the lowness notions associated with these randomness notions. While these bounded notions seem far from classical notions with infinite tests like Martin-Löf and Demuth randomness, the lowness notions associated with bounded randomness turn out...

متن کامل

K-trivial Degrees and the Jump-traceability Hierarchy

For every order h such that P n 1/h(n) is finite, every K-trivial degree is h-jump-traceable. This motivated Cholak, Downey and Greenberg [2] to ask whether this traceability property is actually equivalent to K-triviality, thereby giving the hoped for combinatorial characterisation of lowness for Martin-Löf randomness. We show however that the K-trivial degrees are properly contained in those ...

متن کامل

Finite Self-Information

We present a definition, due to Levin, of mutual information I(A : B) for infinite sequences. We say that a set A has finite self-information if I(A : A) <∞. It is easy to see that every K-trivial set has finite self-information. We answer a question of Levin by showing that the converse does not hold. Finally, we investigate the connections between having finite self-information and other noti...

متن کامل

Turing degrees of reals of positive effective packing dimension

A relatively longstanding question in algorithmic randomness is Jan Reimann’s question whether there is a Turing cone of broken dimension. That is, is there a real A such that {B : B ≤T A} contains no 1-random real, yet contains elements of nonzero effective Hausdorff Dimension? We show that the answer is affirmative if Hausdorff dimension is replaced by its inner analogue packing dimension. We...

متن کامل

Schnorr Dimension

Following Lutz’s approach to effective (constructive) dimension, we define a notion of dimension for individual sequences based on Schnorr’s concept(s) of randomness. In contrast to computable randomness and Schnorr randomness, the dimension concepts defined via computable martingales and Schnorr tests coincide, i.e. the Schnorr Hausdorff dimension of a sequence always equals its computable Hau...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009